From df63707ec116f1c8f33aed325fcd60f1c336ed12 Mon Sep 17 00:00:00 2001 From: Doug Torrance Date: Sun, 24 Jan 2021 13:57:47 +0000 Subject: [PATCH] Remove examples showing less efficient algorithms from Points docs. Bug: https://github.com/Macaulay2/M2/issues/1833 Applied-Upstream: 1.18, https://github.com/Macaulay2/M2/pull/1838 Last-Update: 2021-01-24 They were causing build failures on mipsel and riscv64. Gbp-Pq: Name smaller-points-examples.patch --- M2/Macaulay2/packages/Points.m2 | 18 +----------------- 1 file changed, 1 insertion(+), 17 deletions(-) diff --git a/M2/Macaulay2/packages/Points.m2 b/M2/Macaulay2/packages/Points.m2 index 7982523..e6002b0 100644 --- a/M2/Macaulay2/packages/Points.m2 +++ b/M2/Macaulay2/packages/Points.m2 @@ -958,16 +958,9 @@ document { monomialIdeal G == inG ///, PARA{}, - "Next a larger example that shows that the Buchberger-Moeller algorithm in ", + "The Buchberger-Moeller algorithm in ", TT "points", " may be faster than the alternative method using the intersection of the ideals for each point.", - EXAMPLE lines /// - R = ZZ/32003[vars(0..4), MonomialOrder=>Lex] - M = random(ZZ^5, ZZ^150) - time J = affinePointsByIntersection(M,R); - time C = affinePoints(M,R); - J == C_2 - ///, SeeAlso => {affinePointsByIntersection} } @@ -1148,15 +1141,6 @@ doc /// Text This algorithm may be faster than computing the intersection of the ideals of each projective point. - - Example - K = ZZ/32003 - R = K[z_0..z_5] - M = random(ZZ^6,ZZ^150) - elapsedTime (inG,G) = projectivePoints(M,R); - elapsedTime H = projectivePointsByIntersection(M,R); - G == H - Caveat This function removes zero columns of @TT "M"@ and duplicate columns giving rise to the same projective point (which prevent the algorithm from terminating). The user can bypass this step with the option @TT "VerifyPoints"@. SeeAlso -- 2.30.2